Orbital minimization method with ℓ1 regularization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orbital minimization method with ℓ1 regularization

We consider a modification of the OMM energy functional which contains an ℓ 1 penalty term in order to find a sparse representation of the low-lying eigenspace of self-adjoint operators. We analyze the local minima of the modified functional as well as the convergence of the modified functional to the original functional. Algorithms combining soft thresholding with gradient descent are proposed...

متن کامل

Orbital Minimization with Localization

Orbital minimization is among the most promising linear scaling algorithms for electronic structure calculation. However, to achieve linear scaling, one has to truncate the support of the orbitals and this introduces many problems, the most important of which is the occurrence of numerous local minima. In this paper, we introduce a simple modification of the orbital minimization method, by addi...

متن کامل

Preconditioning Orbital Minimization Method for Planewave Discretization

We present an efficient preconditioner for the orbital minimization method when the Hamiltonian is discretized using planewaves (i.e., pseudospectral method). This novel preconditioner is based on an approximate Fermi operator projection by pole expansion, combined with the sparsifying preconditioner to efficiently evaluate the pole expansion for a wide range of Hamiltonian operators. Numerical...

متن کامل

Fast Learning with Nonconvex L1-2 Regularization

Convex regularizers are often used for sparse learning. They are easy to optimize, but can lead to inferior prediction performance. The difference of `1 and `2 (`1-2) regularizer has been recently proposed as a nonconvex regularizer. It yields better recovery than both `0 and `1 regularizers on compressed sensing. However, how to efficiently optimize its learning problem is still challenging. T...

متن کامل

Least Squares Optimization with L1-Norm Regularization

This project surveys and examines optimization approaches proposed for parameter estimation in Least Squares linear regression models with an L1 penalty on the regression coefficients. We first review linear regression and regularization, and both motivate and formalize this problem. We then give a detailed analysis of 8 of the varied approaches that have been proposed for optimizing this objec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Physics

سال: 2017

ISSN: 0021-9991

DOI: 10.1016/j.jcp.2017.02.005